On Certain Connected Resolving Parameters of Hypercube Networks
نویسندگان
چکیده
Given a graph , a set is a resolving set if for each pair of distinct vertices there is a vertex such that . A resolving set containing a minimum number of vertices is called a minimum resolving set or a basis for . The cardinality of a minimum resolving set is called the resolving number or dimension of and is denoted by . A resolving set is said to be a star resolving set if it induces a star, and a path resolving set if it induces a path. The minimum cardinality of these sets, denoted respectively by = , G V E G , W V , w d v G dim , u v V G
منابع مشابه
A Survey On the Vulnerability Parameters of Networks
The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. In terms of a graph, the concept of connectedness is used in dierent forms to study many of the measures of vulnerability. When certain vert...
متن کاملHypercube Bivariate-Based Key Management for Wireless Sensor Networks
Wireless sensor networks are composed of very small devices, called sensor nodes,for numerous applications in the environment. In adversarial environments, the securitybecomes a crucial issue in wireless sensor networks (WSNs). There are various securityservices in WSNs such as key management, authentication, and pairwise keyestablishment. Due to some limitations on sensor nodes, the previous k...
متن کاملHYPERCUBE Vs CUBE-CONNECTED CYCLES: A TOPOLOGICAL EVALUATION
Hypercubes and cube-connected cycles differ in the number of links per node which has fundamental implications on several issues including performance and ease of implementation. In this paper, we evaluate these networks with respect to a number of parameters including several topological characterizations, fault-tolerance, various broadcast and point-to-point communication primitives. In the p...
متن کاملOn maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
It is shown in this work that all n-dimensional hypercube networks for n P 4 are maximally 3-restricted edge connected. Employing this observation, we analyze the reliability of hypercube networks and determine the first 3n 5 coefficients of the reliability polynomial of n-cube networks. 2010 Published by Elsevier Inc.
متن کاملProperties and Performance of The Block Shift Network - Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
As an interconnection network, hypercube topology offers certain advantages such as high data bandwidth and low message latency to achieve computational efficiency. However, a significant drawback of this topology is that the number of ports per node increases with the number of nodes. In addition, in many applications not all the links are used equally frequently, and links on certain dimensio...
متن کامل